/**
 * @ Author     ：侯耀祖
 * @ Description：
 */
public class integerBreak {
    public static int integerBreak(int n) {
        int[] dp = new int[n+1];
        dp[0]=dp[1]=0;
        dp[2]=1;
        for (int i = 3; i <= n; i++) {
            for (int j = 1; j < i; j++) {
                dp[i] = Math.max(Math.max((j*(i-j)), j*dp[i-j]), dp[i]);
            }
        }
        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(integerBreak(10));
    }
}
